Height-Deterministic Pushdown Automata
نویسندگان
چکیده
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata. Decidability and complexity questions are also considered.
منابع مشابه
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages. The complexity of their membership problem is equivalent to that of regular languages. However, the corresponding counting problem – computing the number of accepting paths in a visibly pushdown automaton – could be harder than counting paths in a non-deterministi...
متن کاملRemoving Nondeterminism in Constant Height Pushdown Automata
We study the descriptional cost of removing nondeterminism in constant height pushdown automata — i.e., pushdown automata with a built-in constant limit on the height of the pushdown. We show a double-exponential size increase when converting a constant height nondeterministic pushdown automaton into an equivalent deterministic device. Moreover, we prove that such a double-exponential blow-up c...
متن کاملThe Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata
We study the size-cost of boolean operations on constant height deterministic pushdown automata. We prove an asymptotically optimal exponential blow-up for union and intersection, as well as polynomial blow-up for complement.
متن کاملSynchronization of Grammars
Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata. The languages recognized by grammars synchronized by a given grammar form an effective boolean algebra lying between regular languages and dete...
متن کاملA linear time extension of deterministic pushdown automata
A linear time extension of deterministic pushdown automata is introduced that recognizes all deterministic context-free languages, but also languages such as {abc | n ≥ 0} and the MIX language. It is argued that this new class of automata, called λ-acyclic read-first deterministic stack+bag pushdown automata, has applications in natural language processing.
متن کامل